MATH 625 Assignment 2

MATH 625 Homework V

Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem

  Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...

A Theorem about the Channel Assignment Problem

The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB — a quadratic assignment problem library. Journal on Global Optimiza...